Functions Computable with Limited Access to NP
نویسنده
چکیده
It is shown for any constant c < 1, that if NPMV have re nements in the class of multivalued functions that are polynomial time computable with c(log n) access to NPSV, then the polynomial time hierarchy collapses to its second level.
منابع مشابه
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions
This paper studies the class of infinite sets that have minimal perfect hash functions one-to-one onto maps between the sets and E·-computable in polynomial time. We show that all standard NP-complete sets have polynomial-time computable minimal per fect hash functions, and give a structural condition sufficient to ensure that all infinite NP sets have polynomial-time computable minimal perfe...
متن کاملErnst-Moritz-Arndt-Universität Greifswald Preprint-Reihe Mathematik The First-Value Operator on Polynomial-Time Computable Functions
The fist-value operator is known as a useful tool in exploring hierarchies established analogously to Hausdorff’s difference hierarchy in topology. We here apply a simplified version of this operator first to computable number theoretic functions and then to functions computable in polynomial time. In combination with composition, it generates the arithmetically representable functions from the...
متن کاملFeasible Functions ∗
It is common to identify the class of computable functions with the class of functions computable by the Turing machine. The identification is done on the ground of the famous Church-Turing thesis. In fact, the thesis justifies only one implication: computable function are Turing computable. The other implication is quite obviously false if computability means practical computability. I am not ...
متن کاملBounded Queries to SAT and the
We study the complexity of decision problems that can be solved by a polynomial-time Turing machine that makes a bounded number of queries to an NP oracle. Depending on whether we allow some queries to depend on the results of other queries, we obtain two (probably) diierent hierarchies. We present several results relating the bounded NP query hierarchies to each other and to the Boolean hierar...
متن کاملConsistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard
In [Bus87] and [BP90] some ‘discovery procedures’ for classical categorial grammars were defined. These procedures take a set of structures (strings labeled with derivational information) as input and yield a set of hypotheses in the form of grammars. In [Kan98] learning functions based on these discovery procedures were studied, and it was shown that some of the classes associated with these f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 58 شماره
صفحات -
تاریخ انتشار 1996